Characterization of Deadlocks in Interconnection Networks
نویسندگان
چکیده
Deadlock-free routing algorithms have been developed recently without fully understanding the frequency and characteristics of deadlocks. Using a simulator capable of true deadlock detection, we measure a network’s susceptibility to deadlock due to various design parameters. The effects of bidirectionality, routing adaptivity, virtual channels, buffer size and node degree on deadlock formation are studied. In the process, we provide insight into the frequency and characteristics of deadlocks and the relationship between routing flexibility, blocked messages, resource dependencies and the degree of correlation needed to form deadlock.
منابع مشابه
Deadlock Characterization and Resolution in Interconnection Networks
This chapter describes three important classes of deadlocking behavior that can occur in interconnection networks used in computer systems and discusses various techniques that can be used to handle them. Network attributes and phenomena that in uence the formation of network deadlocks are identi ed. Ways in which a network's susceptibility to deadlock can be reduced are presented. Advantages a...
متن کاملTree-Based Multicasting on Wormhole Routed Multistage Interconnection Networks
In this paper, we propose a tree-based multicasting algorithm for Multistage Interconnection Networks. We rst analyze the necessary conditions for deadlocks in MINs. Based on these observations, an asyn-chronous tree-based multicasting algorithm is developed in which deadlocks are prevented by serializing the initiations of branching operations that have potential for creating deadlocks. The se...
متن کاملModularity, Routing and Fault Tolerance in Interconnection Networks
In interconnection networks, there are several problems related to deadlock. We shall address deadlocks in the context of modularity, shortest path routing in irregular networks and fault tolerance. Deadlock freedom in interconnection networks is not a modular issue. One cannot generally combine two or more deadlock free interconnection network configurations without introducing new deadlock pr...
متن کاملPerformance Analysis of a New Neural Network for Routing in Mesh Interconnection Networks
Routing is one of the basic parts of a message passing multiprocessor system. The routing procedure has a great impact on the efficiency of a system. Neural algorithms that are currently in use for computer networks require a large number of neurons. If a specific topology of a multiprocessor network is considered, the number of neurons can be reduced. In this paper a new recurrent neural ne...
متن کاملAsynchronous Tree-Based Multicasting in Wormhole-Switched MINs
Multicast operation is an important operation in multicomputer communication systems and can be used to support several collective communication operations. A signiicant performance improvement can be achieved by supporting multicast operations at the hardware level. In this paper, we propose an asynchronous tree-based multicasting (ATBM) technique for multistage interconnec-tion networks (MINs...
متن کامل